Nordhaus-Gaddum-type results for resistance distance-based graph invariants
نویسندگان
چکیده
منابع مشابه
Nordhaus-Gaddum Type Results for Total Domination
A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper we study Nordhaus-Gaddum-type results for total domination. We examine the sum and product of γt(G1) and γt(G2) where G1 ⊕G2 = K(s, s), and γt is the total domination number. We show that the maximum value of the sum of the total domination numbers of...
متن کاملSome nordhaus- gaddum-type results
A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper some variations are considered. First, the sums and products of ψ(G1) and ψ(G2) are examined where G1 ⊕ G2 = K(s, s), and ψ is the independence, domination, or independent domination number, inter alia. In particular, it is shown that the maximum valu...
متن کاملNordhaus-Gaddum type results for the Harary index of graphs
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
متن کاملNordhaus-Gaddum for Treewidth
We prove that, for every n-vertex graph G, the treewidth of G plus the treewidth of the complement of G is at least n − 2. This bound is tight. © 2012 Gwenaël Joret and David R. Wood. Published by Elsevier Ltd. All rights reserved. Nordhaus–Gaddum-type theorems establish bounds on f (G) + f (G) for some graph parameter f , where G is the complement of a graph G. The literature has numerous exam...
متن کاملnordhaus-gaddum type results for the harary index of graphs
the emph{harary index} $h(g)$ of a connected graph $g$ is defined as $h(g)=sum_{u,vin v(g)}frac{1}{d_g(u,v)}$ where $d_g(u,v)$ is the distance between vertices $u$ and $v$ of $g$. the steiner distance in a graph, introduced by chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. for a connected graph $g$ of order at least $2$ and $ssubseteq v(g)$, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2016
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1890